# 斐波那契递归实现
def fib_func_1(n):
  if n < 1:
    return
  elif 1 <= n < 3:
    return 1
  else:
    return fib_func_1(n - 1) + fib_func_1(n - 2)


if __name__ == '__main__':
  n = 10
  for i in range(n + 1):
    print(fib_func_1(i))



